A variable-penalty alternating directions method for convex optimization
نویسندگان
چکیده
We study a generalized version of the method of alternating directions as applied to the minimization of the sum of two convex functions subject to linear constraints. The method consists of solving consecutively in each iteration two optimization problems which contain in the objective function both Lagrangian and proximal terms. The minimizers determine the new proximal terms and a simple update of the Lagrangian terms follows. We prove a convergence theorem which extends existing results by relaxing the assumption of uniqueness of minimizers. Another novelty is that we allow penalty matrices, and these may vary per iteration. This can be beneecial in applications, since it allows additional tuning of the method to the problem and can lead to faster convergence relative to xed penalties. As an application, we derive a decomposition scheme for block angular optimization and present computational results on a class of dual block angular problems.
منابع مشابه
Modified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کاملModified alternating direction method of multipliers for convex quadratic semidefinite programming
The dual form of convex quadratic semidefinite programming (CQSDP) problem, with nonnegative constraints on the matrix variable, is a 4-block convex optimization problem. It is known that, the directly extended 4-block alternating direction method of multipliers (ADMM) is very efficient to solve this dual, but its convergence are not guaranteed. In this paper, we reformulate it as a 3-block con...
متن کاملLinearized Alternating Direction Method with Parallel Splitting and Adaptive Penalty for Separable Convex Programs in Machine Learning – Supplementary Materials
متن کامل
Particle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems
The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...
متن کاملOn the Convergence of Constrained Parallel Variable Distribution Algorithms
We consider the parallel variable distribution (PVD) approach proposed by Ferris and Mangasarian [SIAM J. Optim., 4 (1994), pp. 815–832] for solving optimization problems. The problem variables are distributed among p processors with each processor having the primary responsibility for updating its block of variables while allowing the remaining “secondary” variables to change in a restricted f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 83 شماره
صفحات -
تاریخ انتشار 1998